#define _CRT_SECURE_NO_WARNINGS 1
#include"Sort.h"


void TestOP()
{
	srand(time(0));
	const int N = 1000000;
	int* a1 = (int*)malloc(sizeof(int) * N);
	int* a2 = (int*)malloc(sizeof(int) * N);
	int* a3 = (int*)malloc(sizeof(int) * N);
	int* a4 = (int*)malloc(sizeof(int) * N);
	int* a5 = (int*)malloc(sizeof(int) * N);
	int* a6 = (int*)malloc(sizeof(int) * N);
	if (a1 == NULL || a2 == NULL || a3 == NULL || a4 == NULL || a5 == NULL || a6 == NULL)
	{
		exit(-1);
	}
	for (int i = 0; i < N; ++i)
	{
		a1[i] = rand();
		//a1[i] = 1;
		a2[i] = a1[i];
		a3[i] = a1[i];
		a4[i] = a1[i];
		a5[i] = a1[i];
		a6[i] = a1[i];
	}
	int begin1 = clock();
	//InsertSort(a1, N);
	int end1 = clock();

	int begin2 = clock();
	ShellSort(a2, N);
	int end2 = clock();

	int begin3 = clock();
	//SelectSort(a3, N);
	int end3 = clock();
	
	int begin4 = clock();
	HeapSort(a4, N);
	int end4 = clock();
	
	int begin5 = clock();
	QuickSort(a5, 0, N - 1);
	//BubbleSort(a5, N);
	int end5 = clock();
	
	int begin6 = clock();
	MergeSort(a6, N);
	int end6 = clock();
	printf("InsertSort:%d\n", end1 - begin1);
	printf("ShellSort:%d\n", end2 - begin2);
	printf("SelectSort:%d\n", end3 - begin3);
	printf("HeapSort:%d\n", end4 - begin4);
	//printf("BubbleSort:%d\n", end5 - begin5);
	printf("QuickSort:%d\n", end5 - begin5);
	printf("MergeSort:%d\n", end6 - begin6);
	free(a1);
	free(a2);
	free(a3);
	free(a4);
	free(a5);
	free(a6);
}

void TestInsertSort()
{
	int arr[] = { 6, 5, 8, 4, 5, 4, 1, 5, 5, 1, 5 };
	InsertSort(arr, sizeof(arr) / sizeof(arr[0]));
	Print(arr, sizeof(arr) / sizeof(arr[0]));
}


void TestShellSort()
{
	int arr[] = { 6, 5, 8, 4, 5, 4, 1, 5, 5, 1, 5 };
	ShellSort(arr, sizeof(arr) / sizeof(arr[0]));
	Print(arr, sizeof(arr) / sizeof(arr[0]));
}


void TestSelectSort()
{
	int arr[] = { 6, 5, 8, 4, 3, 0, 1, 9, 11, 1, 6 };
	SelectSort(arr, sizeof(arr) / sizeof(arr[0]));
	Print(arr, sizeof(arr) / sizeof(arr[0]));
}

void TestHeapSort()
{
	int arr[] = { 6, 5, 8, 4, 3, 0, 1, 9, 11, 1, 6 };
	HeapSort(arr, sizeof(arr) / sizeof(arr[0]));
	Print(arr, sizeof(arr) / sizeof(arr[0]));
}

void TestBubbleSort()
{
	int arr[] = { 6, 7, 85, 42, 3, 0, 1, 43, 11, 3, 6 };
	BubbleSort(arr, sizeof(arr) / sizeof(arr[0]));
	Print(arr, sizeof(arr) / sizeof(arr[0]));
}

void TestQuickSort()
{
	int arr[] = { 6,1,2,7,9,3,4,5,10,8 };
	QuickSort(arr,0,sizeof(arr)/sizeof(arr[0])-1);
	Print(arr, sizeof(arr) / sizeof(arr[0]));
}

void TestQuickSortNonR()
{
	int arr[] = { 6,1,2,7,9,3,4,5,10,8 };
	QuickSortNonR(arr, 0, sizeof(arr) / sizeof(arr[0]) - 1);
	Print(arr, sizeof(arr) / sizeof(arr[0]));
}

void TestMergeSort()
{
	int arr[] = { 6,1,2,7,9,3,4,5,10,8 };
	MergeSort(arr, sizeof(arr) / sizeof(arr[0]));
	Print(arr, sizeof(arr) / sizeof(arr[0]));
}

void TestCountSort()
{
	int arr[] = { 6,1,2,7,9,3,4,5,10,8,-5,0,13,-1 };
	CountSort(arr, sizeof(arr) / sizeof(arr[0]));
	Print(arr, sizeof(arr) / sizeof(arr[0]));
}

int main()
{
	//TestInsertSort();
	//TestShellSort();
	//TestSelectSort();
	//TestHeapSort();
	//TestBubbleSort();
	//TestQuickSort();
	//TestQuickSortNonR();
	//TestMergeSort();
	TestCountSort();
	//TestOP();
	return 0;
}